Stability Conditions of the MMAP[K]/G[K]/1/LCFS Preemptive Repeat Queue
نویسندگان
چکیده
Stability Conditions of the MMAP[K]/G[K]/1/LCFS Preemptive Repeat Queue Qi-Ming HE, Department of Industrial Engineering, DalTech, Dalhousie University Halifax, Nova Scotia, Canada B3J 2X4, [email protected] Hui Li, Department of Mathematics, Mount Saint Vincent University Halifax, Nova Scotia, Canada B3M 2J6, Email: [email protected]
منابع مشابه
Classification of Markov Processes of Matrix M/G/1 type with a Tree Structure and its Applications to the MMAP[K]/G[K]/1 Queue
The purpose of this paper is to study the classification problem of discrete time and continuous time Markov processes of matrix M/G/1 type with a tree structure. We begin this paper by developing a computational method to find whether a Markov process of matrix M/G/1 type with a tree structure is positive recurrent, null recurrent, or transient. The method is then used to study the impact of t...
متن کاملThe Discrete Time MMAP[K]/PH[K]/1/LCFS-GPR Queue and Its Variants
Abstract: In this paper, we study a discrete time queueing system with multiple types of customers and a last-come-first-served general preemptive resume (LCFS-GPR) service discipline (MMAP[K]/PH[K]/1/LCFS-GPR). When the waiting space is infinite, matrix analytic methods are used to find a system stability condition, to derive the distributions of the busy periods and sojourn times, and to obta...
متن کاملQuasi-birth-and-death Markov processes with a tree structure and the MMAP[K]/PH[K]/N/LCFS non-preemptive queue
This paper studies a multi-server queueing system with multiple types of customers and last-come-®rst-served (LCFS) non-preemptive service discipline. First, a quasi-birth-and-death (QBD) Markov process with a tree structure is de®ned and some classical results of QBD Markov processes are generalized. Second, the MMAP[K]/PH[K]/N/LCFS non-preemptive queue is introduced. Using results of the QBD ...
متن کاملMatrix Product-Form Solutions for LCFS Preemptive Service Single-Server Queues with Batch Markovian Arrival Streams
This paper considers three variants of last-come first-served (LCFS) preemptive service single-server queues, where customers are served under the LCFS preemptive resume (LCFS-PR), preemptive repeat-different (LCFS-PD), and preemptive repeat-identical (LCFS-PI) disciplines, respectively. These LCFS queues are fed by multiple batch Markovian arrival streams. Service times of customers from each ...
متن کاملClassification of Markov Processes of Matrix M/G/1 type with a Tree Structure and its Applications to the MMAP[K]/G[K]/1 Queues
This paper studies the classification problem of discrete time and continuous time Markov processes of matrix M/G/1 type with a tree structure. It is shown that the Perron-Frobenius eigenvalue of a nonnegative matrix provides information for a complete classification of the Markov process of interest. A computational method is developed to find whether a Markov process of matrix M/G/1 type with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Queueing Syst.
دوره 44 شماره
صفحات -
تاریخ انتشار 2003